Eecient Hpf Programs

HPF was originally created to simplify high-level programming of parallel computers. The inventors of HPF strove for an easy-to-use language which was intended to enable portability and e ciency. However, up until now the desired e ciency has not been reached. On the contrary, HPF programs are notorious for their poor performance. This paper provides a rehabilitation of HPF. It is demonstrated how currently available HPF constructs can be utilized to solve sizeable numerical problems in a highly e cient manner. Using the techniques published in this paper, the empirical e ciency, i. e. the ratio between the empirical oating-point performance and the theoretical peak performance, can be driven up to 60% and more. Even on message passing machines with slow communication networks, such as PC clusters (Beowulf clusters) using 100 Mbit/s Ethernet interconnection, empirical e ciency results at a very satisfactory level can be obtained.